Curve Reconstruction of Digitized Surface Using K-means Algorithm
نویسندگان
چکیده
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملOptimal Surface Reconstruction from Digitized Point Data using CI Methods
In many scienti c and technological endeavors, a three-dimensional solid must be reconstructed from digitized point data. This paper presents three solutions to the problem of reconstructing smooth surfaces using triangular tiles. The presented algorithms di er in their strategic approach. Here, two deterministic algorithms and one non-deterministic CI (computational intelligence) strategy will...
متن کاملOptimal Surface Reconstruction from Digitized Point Data using CI
In many scientiic and technological endeavors, a three-dimensional solid must be reconstructed from digitized point data. This paper presents three solutions to the problem of reconstructing smooth surfaces using triangular tiles. The presented algorithms diier in their strategic approach. Here, two deterministic algorithms and one non-deterministic CI (computational intelligence) strategy will...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملClustering Using Boosted Constrained k-Means Algorithm
This article proposes a constrained clustering algorithmwith competitive performance and less computation time to the state-of-the-art methods, which consists of a constrained k-means algorithm enhanced by the boosting principle. Constrained k-means clustering using constraints as background knowledge, although easy to implement and quick, has insufficient performance compared with metric learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2014
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2014.03.024